An infinitely-often one-way function based on an average-case assumption

An Infinitely-Often One-Way Function Based on an Average-Case Assumption

We assume the existence of a function f that is computable in polynomial time but cannot be inverted by a randomized average-case polynomial algorithm. The cryptographic setting is, however, different: even for a weak one-way function, a successful adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f . §

Infinitely-Often Autoreducible Sets

A set A is autoreducible if one can compute, for all x, the value A(x) by querying A only at places y 6= x. Furthermore, A is infinitely-often autoreducible if, for infinitely many x, the value A(x) can be computed by querying A only at places y 6= x. For all other x, the computation outputs a special symbol to signal that the reduction is undefined. It is shown that for polynomial time Turing ...

Average-Case Competitive Analyses for One-Way Trading

Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m,M ]. The game ends without advance notice, then the trader is forced to exchange all the remaining dollars at the minimum rate m. El-Yaniv et al. presented the optimal worst-case threat-based strategy for this game [EFKT01]. In this paper, under the assumption that the distrib...

An industrial case study on an architectural assumption documentation framework

As an important type of architectural knowledge, documenting architectural assumptions (AAs) is critical to the success of projects. In this work, we proposed and validated an Architectural Assumption Documentation Framework (AADF), which is composed of four viewpoints (i.e., the Detail, Relationship, Tracing, and Evolution viewpoint), to document AAs in projects. One case study with two cases ...

An Assumption-Based TMS